A Novel Hexagonal Search Algorithm for Fast Block Matching Motion Estimation
نویسندگان
چکیده
Based on real-world image sequence characteristics of center-biased motion vector distribution, a Hexagonal (HS) algorithm with center-biased checking point pattern for fast block motion estimation is proposed. The HS is compared with full search (FS), four-step search (4SS), new three-step search (NTSS), and recently proposed diamond search (DS) methods. Experimental results show that the proposed technique provides competitive performance with reduced computational complexity.
منابع مشابه
Adaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملAn Modified Un-Even Hexagonal Block Search Algorithm For Fast Motion Estimation In Video Coding
Motion estimation is one of the important factors to be considered for video coding. In this paper, the main objective is to increase the motion estimation in terms of fast, low complexity and reduced cost. To do this, in this paper an Modified Un Even Multi Hexagonal grid search algorithm [MUEHS] developed to obtain fast motion estimation for video coding by using hybrid block matching and sea...
متن کاملA Frequency Based Hierarchical Fast Search Block Matching Algorithm for Fast Video Communication
Numerous fast-search block motion estimation algorithms have been developed to circumvent the high computational cost required by the full-search algorithm. These techniques however often converge to a local minimum, which makes them subject to noise and matching errors. Hence, many spatial domain block matching algorithms have been developed in literature. These algorithms exploit the high cor...
متن کاملFast Computational Four-Neighborhood Search Algorithm For Block matching Motion Estimation
The Motion estimation is an effective method for removing temporal redundancyfound in video sequence compression. Block Matching algorithm has been widely used in motion estimation and a number of fast algorithms have proposed to reduce the computational complexity of BMA. In this paper we propose a new search strategy for fast block matching based on Four-Neighborhood Search (FNS) and fast com...
متن کاملNovel Block Motion Estimation Based on Adaptive Search Patterns
An improved algorithm for fast motion estimation based on the block matching algorithm (BMA) is presented for use in a blockbased video coding system. To achieve enhanced motion estimation performance, we propose an adaptive search pattern length for each iteration for the current macro block (MB). In addition, search points that must be checked are determined by means of directional informatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- EURASIP J. Adv. Sig. Proc.
دوره 2002 شماره
صفحات -
تاریخ انتشار 2002